QT-CBP: A New RFID Tag Anti-collision Algorithm Using Collision Bit Positioning

نویسندگان

  • Hyunji Lee
  • Jongdeok Kim
چکیده

The ability to recognize many tags simultaneously is crucial for many advanced RFID-based applications. The tag anti-collision algorithm of an RFID system, which arbitrates collisions on the air interface among tags in the same reading range of a reader, makes a great influence on the speed and the reliability in multiple tag recognition. This paper presents a new memoryless tag anti-collision algorithm, QT-CBP (Query Tree with Collision Bit Positioning), which is designed based on QT (Query Tree) algorithm. QT-CBP is likely to make more concise tree traversal than QT by extracting and making use of detailed information on a collision condition, such as the number of collision bits and their positions. Basically QT-CBP is an enhanced algorithm for readers running QT, so no change is required at tags. Simulation study shows that QT-CBP outperforms QT, especially on the condition where tags have similar tag IDs by having the same company or product ID prefixes.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

افزایش سرعت شناسایی در سیستم‌های RFID

Radio frequency identification (RFID) is a new generation of automatic identification systems, based on wireless communication technology. In these systems all the tags using one communication channel to communicate with the reader. When two or more tags transmit their data to the reader simultaneously, their transmitted signals will collide. Resolving this collision has a direct impact on the ...

متن کامل

Tag Anti-collision Algorithm for RFID Systems with Minimum Overhead Information in the Identification Process

This paper describes a new tree based anti-collision algorithm for Radio Frequency Identification (RFID) systems. The proposed technique is based on fast parallel binary splitting (FPBS) technique. It follows a new identification path through the binary tree. The main advantage of the proposed protocol is the simple dialog between the reader and tags. It needs only one bit tag response followed...

متن کامل

An efficient Anti-Collision Algorithm for RFID System

-Radio frequency identification (RFID) is an automatic identification system working through radio frequency (RF). Tag collision occurs while two or more than two tags deliver their unique identification (UID) to the reader. Since collision, which would significantly affect the efficacy of RFID, has been one of the major study issues for RFID technology, we have developed a solution, bit compet...

متن کامل

YA-NING YAN et al: AN EFFICIENT TAG IDENTIFICATION ALGORITHM BASED ON IMPROVED COLLISION

Tag collision has a negative impact on the performance of RFID systems. In this paper, we propose an algorithm termed anti-collision protocol based on improved collision detection (ACP-ICD). In this protocol, dual prefixes matching and collision bit detection technique are employed to reduce the number of queries and promptly identify tags. According to the dual prefixes matching method and col...

متن کامل

An improved accelerated frame slotted aloha (afsa) algorithm for tag collision in rfid

The efficiency of tag identification in an RFID (radio identification system) can be low down due to the tag collision problems. The tag collision problem occurs when a reader try to read multiple tags in an interrogation zone. As a result, the reader doesn’t identify the tag correctly. That causes a loss of information or data interference. To solve such kind of issues a series of ALOHA based ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006